NP-hardness of deciding convexity of quartic polynomials and related problems
نویسندگان
چکیده
منابع مشابه
NP-hardness of Deciding Convexity of Quartic Polynomials and Related Problems
We show that unless P=NP, there exists no polynomial time (or even pseudo-polynomial time) algorithm that can decide whether a multivariate polynomial of degree four (or higher even degree) is globally convex. This solves a problem that has been open since 1992 when N. Z. Shor asked for the complexity of deciding convexity for quartic polynomials. We also prove that deciding strict convexity, s...
متن کاملNP-hardness of linear multiplicative programming and related problems
The linear multiplicative programming problem minimizes a product of two (positive) variables subject to linear inequality constraints. In this paper, we show NP-hardness of linear multiplicative programming problems and related problems.
متن کاملNP-hardness of polytope M-matrix testing and related problems
In this note we prove NP-hardness of the following problem: Given a set of matrices, is there a convex combination of those that is a nonsingular M-matrix? Via known characterizations of M-matrices, our result establishes NP-hardness of several fundamental problems in systems analysis and control, such as testing the instability of an uncertain dynamical system, and minimizing the spectral radi...
متن کاملthe evaluation of language related engagment and task related engagment with the purpose of investigating the effect of metatalk and task typology
abstract while task-based instruction is considered as the most effective way to learn a language in the related literature, it is oversimplified on various grounds. different variables may affect how students are engaged with not only the language but also with the task itself. the present study was conducted to investigate language and task related engagement on the basis of the task typolog...
15 صفحه اولproblems and strategies of translating persian lexical collocations into english: the case of noun-verb and noun-adjective collocations
در محیط های دانشگاهی ایران ، آموزش ترجمه واژگان هم آیند که به منزله امری لاینفک برای دانش جویان رشته مترجمی زبان می باشد، تا حدود زیادی نادیده گرفته شده است . این واقعیت باعث شده است تا دانش جویان رشته مترجمی زبان در ترجمه ی واژگان هم آیند اشتباهات بسیاری مرتکب شوند. این پژوهش توجه ویژه ای به ترجمه واژگان هم آیند داشته است. برای مشخص نمودن مشکلات و استراتژی های مورد استفاده ی دانش جویان در ترجم...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2011
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-011-0499-2